Min-max Algorithm for the Parametric Flow Problem
نویسندگان
چکیده
The algorithm presented in this paper solves the minimum flow problem in a parametric network with linear lower bound functions by computing a parametric maximum flow from the sink node to the source node. The algorithm does not work directly in the original parametric network but in the parametric residual network defined as for the parametric maximum flow problem. The complexity of the parametric minmax algorithm is equal to the complexity of the parametric maximum flow algorithm. 2000 Mathematics Subject Classification: 58F25, 90B10, 90C31, 05C85.
منابع مشابه
Certificates of optimality: the third way to biproportional apportionment
The biproportional apportionment problem (BAP) must be faced in many proportional electoral systems where seats must be allocated to parties within regions. BAP is a non trivial optimization problem, and only sophisticated algorithms are currently available for solving it. The issue is: are they “writable” as an actual law? Citizens rightly demand simple, easy to understand, voting systems. The...
متن کاملOn the optimization of Dombi non-linear programming
Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...
متن کاملMax-Min averaging operator: fuzzy inequality systems and resolution
Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...
متن کاملMin-max Model Predictive Control as a Quadratic Program
This paper deals with the implementation of min-max model predictive control for constrained linear systems with bounded additive uncertainties and quadratic cost functions. This type of controller has been shown to be a continuous piecewise affine function of the state vector by geometrical methods. However, no algorithm for computing the explicit solution has been given. In this paper, we sho...
متن کاملApproximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)
In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988 [9] and extended in 1999 [10] for uniform multicommodity flow problems. In the theorems they first showed that for any n-node multicommodity flow problem with uniform demands, the max-flow is a Ω(log n) factor smaller than the min-cut; further,they proved the max-flo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010